Supporting Math Trails on Property Graphs

نویسندگان

  • Sai Sumana Pagidipalli
  • Veena S. Kambi
  • Sudha R. Nakati
  • Jagannathan Srinivasan
چکیده

pg-MathTrails is an application developed to assess math skills of school students. It includes i) topic hierarchy to categorize the questions, ii) question template repository using which teachers can add different types of questions, iii) question play module to play questions, iv) student evaluation module to evaluate student performance, and v) recommender that recommends videos residing in a video repository. A key feature is that each interactive student session is treated as a walking trail in the property graph formed by topic and question nodes, and student evaluation involves operations on the property graph. The application is being used in the after-school program of Sri Sarada Academy of Excellence, Bangalore.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spanning trails in essentially 4-edge-connected graphs

A connected graphG is essentially 4-edge-connected if for any edge cut X ofGwith |X | < 4, either G − X is connected or at most one component of G − X has edges. In this paper, we introduce a reductionmethod and investigate the existence of spanning trails in essentially 4-edge-connected graphs. As an application, we prove that if G is 4-edge-connected, then for any edge subset X0 ⊆ E(G) with |...

متن کامل

The Total Interval Number of a Graph II: Trees and Complexity

A multiple-interval representation of a simple graph G assigns each vertex a union of disjoint real intervals, such that vertices are adjacent if and only if their assigned sets intersect. The total interval number I (G) is the minimum of the total number of intervals used in any such representation of G. For triangle-free graphs, I (G) = m + t(G), where m is the number of edges in G and t(G) i...

متن کامل

Zig-zag and replacement product graphs and LDPC codes

It is known that the expansion property of a graph influences the performance of the corresponding code when decoded using iterative algorithms. Certain graph products may be used to obtain larger expander graphs from smaller ones. In particular, the zig-zag product and replacement product may be used to construct infinite families of constant degree expander graphs. This paper investigates the...

متن کامل

On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms

We study a prize-collecting version of the uncapacitated facility location problem and of the p-median problem. We say that the uncapacitated facility location polytope has the intersection property if adding the extra equation that fixes the number of opened facilities does not create any fractional extreme point. We characterize the graphs for which this polytope has the intersection property...

متن کامل

Graph Theory By Lars

This development provides a formalization of directed graphs, supporting (labelled) multi-edges and infinite graphs. A polymorphic edge type allows edges to be treated as pairs of vertices, if multi-edges are not required. Formalized properties are i.a. walks (and related concepts), connectedness and subgraphs and basic properties of isomorphisms. This formalization is used to prove characteriz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014